ASYMPTOTIC UPPER BOUNDS ON THE SHADES OF t-INTERSECTING FAMILIES
نویسنده
چکیده
We examine the m-shades of t-intersecting families of k-subsets of [n], and conjecture on the optimal upper bound on their cardinalities. This conjecture extends Frankl’s General Conjecture that was proven true by Ahlswede–Khachatrian. From this we deduce the precise asymptotic upper bounds on the cardinalities of m-shades of t(m)-intersecting families of k(m)subsets of [2m], as m → ∞. A generalization to cross-t-intersecting families is also considered.
منابع مشابه
Nonhomogeneous analytic families of trees
We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This dichotomy implies that every nontrivial Souslin poset satisfying the countable chain condition adds a splitting real. We then reduce the dichotomy to a conj...
متن کاملUniform Intersecting Families with Covering Number Restrictions
It is known that any k-uniform family with covering number t has at most k t t-covers. In this paper, we give better upper bounds for the number of t-covers in k-uniform intersecting families with covering number t.
متن کاملThe Intersection Structure of t-Intersecting Families
A family of sets is t-intersecting if any two sets from the family contain at least t common elements. Given a t-intersecting family of r-sets from an n-set, how many distinct sets of size k can occur as pairwise intersections of its members? We prove an asymptotic upper bound on this number that can always be achieved. This result can be seen as a generalization of the Erdős-Ko-Rado theorem.
متن کامل3-Wise Exactly 1-Intersecting Families of Sets
Let f(l,t,n) be the maximal size of a family F ⊂ 2[n] such that any l ≥ 2 sets of F have an exactly t ≥ 1-element intersection. If l ≥ 3, it trivially comes from [8] that the optimal families are trivially intersecting (there is a t-element core contained by all the members of the family). Hence it is easy to determine f(l, t, n) = ⌊ l 2(n− 1) ⌋ +1. Let g(l, t, n) be the maximal size of an l-wi...
متن کاملOn the kernel of intersecting families
Let ~ be a t-wise s-intersecting family, i.e., [F a N"" N F t I > s holds for every t members of ~¢~. Then there exists a set Y such that I Fx N.'-N F, N Y[ _>_ s still holds for every Fl ..... F, e ~. Here exponential lower and upper bounds are proven for the possible sizes of Y.
متن کامل